Random Sparse Polynomial Systems
نویسندگان
چکیده
Abstract Let f :=(f1, . . . , fn) be a sparse random polynomial system. This means that each f i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form. When U = (C∗)n, the classical mixed volume is recovered. The main result in this paper is a bound on the probability that the condition number of f on the region U is larger than 1/ε. This bound depends on the integral of the mixed volume form over U , and on a certain intrinsic invariant of U as a subset of a toric manifold. Polynomials with real coefficients are also considered, and bounds for the expected number of real roots and for the condition number are given. The connection between zeros of sparse random polynomial systems, Kähler geometry, and mechanics (momentum maps) is discussed.
منابع مشابه
Reconstruction of sparse Legendre and Gegenbauer expansions
Recently the reconstruction of sparse trigonometric polynomials has attained much attention. There exist recovery methods based on random sampling related to compressed sensing (see e.g. [17, 10, 5, 4] and the references therein) and methods based on deterministic sampling related to Prony–like methods (see e.g. [15] and the references therein). Both methods are already generalized to other pol...
متن کاملSecure PRNGs from Specialized Polynomial Maps over Any
We prove that a random map drawn from any class C of polynomial maps from (Fq) to (Fq) that is (i) totally random in the a ne terms, and (ii) has a negligible chance of being not strongly one-way, provides a secure PRNG (hence a secure stream cipher) for any q. Plausible choices for C are semi-sparse (i.e., the a ne terms are truly random) systems and other systems that are easy to evaluate fro...
متن کاملSparse Recovery
List of included articles [1] H. Rauhut. Random sampling of sparse trigonometric polynomials. Appl. Comput. [2] S. Kunis and H. Rauhut. Random sampling of sparse trigonometric polynomials II-orthogonal matching pursuit versus basis pursuit. [3] H. Rauhut. Stability results for random sampling of sparse trigonometric polynomi-als. [4] H. Rauhut. On the impossibility of uniform sparse reconstruct...
متن کاملMeshes that trap random subspaces
In our recent work [30, 33] we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a polynomial l1-optimization technique when used for solving such systems. As one of the tools we used a probabilistic result of Gordon [18]. In this paper we revisit this classic result i...
متن کاملSparse tensor Galerkin discretizations for parametric and random parabolic PDEs I: Analytic regularity and gpc-approximation
For initial boundary value problems of linear parabolic partial differential equations with random coefficients, we show analyticity of the solution with respect to the parameters and give an apriori error analysis for sparse tensor, space-time discretizations. The problem is reduced to a parametric family of deterministic initial boundary value problems on an infinite dimensional parameterspac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000